Satisfiability Testing Using Simplification in Boolean Rings
نویسندگان
چکیده
We propose a method for testing satisfiability based on Boolean rings. We make heavy use of simplification, but avoid the potential size increase associated with the use of the distributive law. We present several complexity results, which suggest why our method may be relatively effective in many cases.
منابع مشابه
Boolean Ring Satisfiability
We propose a method for testing satisfiability based on Boolean rings. It makes heavy use of simplification, but avoids the potential size increase associated with application of the distributive law by employing a combined linear and binomial representation. Several complexity results suggest why the method may be relatively effective in many cases. The framework is also amenable to learning f...
متن کاملIntersection-Based Methods for Satisfiability Using Boolean Rings
A potential advantage of using a Boolean-ring formalism for propositional formulæ is the large measure of simplification it facilitates. We propose a combined linear and binomial representation for Boolean ring polynomials, with which one can easily apply Gaussian elimination and Horn-clause methods to advantage. The framework is especially amenable to intersection-based learning. Experiments s...
متن کاملBoolean Rings for Intersection-Based Satisfiability
A potential advantage of using a Boolean-ring formalism for propositional formulæ is the large measure of simplification it facilitates. We propose a combined linear and binomial representation for Booleanring polynomials with which one can easily apply Gaussian elimination and Horn-clause methods to advantage. We demonstrate that this framework, with its enhanced simplification, is especially ...
متن کاملQUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
We describe Qubos (QUantified BOolean Solver), a decision procedure for quantified Boolean logic. The procedure is based on nonclausal simplification techniques that reduce formulae to a propositional clausal form after which off-the-shelf satisfiability solvers can be employed. We show that there are domains exhibiting structure for which this procedure is very effective and we report on exper...
متن کاملA novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two operations: expansion and simplification are used to explains why using algebra grows the resolution steps. It is proved that its complexity has an upper bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003